Quantum deduction rules (preliminary version)
نویسنده
چکیده
We define propositional quantum Frege proof systems and compare it with classical Frege proof systems.
منابع مشابه
An Episodic Knowledge Representation for Narrative Texts
We would like to build story understanding systems which are transparent, modular, and extensible. To this end, we have been working on a new logical approach to narrative understanding that features a GPSG-style grammar and an episodic logic with probabilistic inference rules. The grammar represents phrase structure and the relationship between phrase structure and logical form in a modular, e...
متن کاملProofs, Upside Down - A Functional Correspondence between Natural Deduction and the Sequent Calculus
It is well known in proof theory that sequent-calculus proofs differ from natural deduction proofs by “reversing” elimination rules upside down into left introduction rules. It is also well known that to each recursive, functional program corresponds an equivalent iterative, accumulator-passing program, where the accumulator stores the continuation of the iteration, in “reversed” order. Here, w...
متن کاملRules of Definitional Reflection
This paper discusses two rules of definitional reflection: The “logical” version of definitional reflection as used in the extended logic programming language GCLA and the “ω”-version of definitional reflection as proposed by Eriksson and Girard. The logical version is a Left-introduction rule completely analogous to the Left-introduction rules for logical operators in Gentzen-style sequent sys...
متن کاملQuantum coherent spaces and linear logic
Quantum Coherent Spaces were introduced by Girard as a quantum framework where to interpret the exponential-free fragment of Linear Logic. Aim of this paper is to extend Girard’s interpretation to a subsystem of linear logic with bounded exponentials. We provide deduction rules for the bounded exponentials and, correspondingly, we introduce the novel notion of bounded exponentials of Quantum Co...
متن کاملOpenWordNet-PT: An Open Brazilian Wordnet for Reasoning
Brazilian Portuguese needs a Wordnet that is open access, downloadable and changeable, so that it can be improved by the community interested in using it for knowledge representation and automated deduction. This kind of resource is also very valuable to linguists and computer scientists interested in extracting and representing knowledge obtained from texts. We discuss briefly the reasons for ...
متن کامل